A General Method for Efficient Embeddings of Graphs into Optimal Hypercubes
نویسندگان
چکیده
Embeddings of several graph classes into hypercubes have been widely studied. Unfortunately, almost all investigated graph classes are regular graphs such as meshes, complete trees, pyramids. In this paper, we present a general method for one-to-one embedding irregular graphs into their optimal hypercubes based on extended-edge-bisectors of graphs. An extended-edge-bisector is an edge-bisector with the additional property that a subset of the vertices is distributed more or less evenly among the two halves of the bisected graph. The dilation and congestion of the embedding depends on the quality of the extended-edge-bisector. Moreover, if the extended bisection can be efficiently computed on the hypercube, so can the embedding.
منابع مشابه
Efficient Embeddings into Hypercube-like Topologies
Embeddings of various graph classes into hypercubes have been widely studied. Almost all these classes are regularly structured graphs such as meshes, complete trees or pyramids. In this paper, we present a general method for one-to-one embeddings of irregularly structured graphs into their optimal hypercubes, based on extended edge bisectors of graphs. An extended edge bisector is an edge bise...
متن کاملApplications of isometric embeddings to chemical graphs
Abstract. Applications of isometric embeddings of benzenoid graphs are surveyed. Their embeddings into hypercubes provide methods for computing the Wiener index and the Szeged index, while embeddings into the Cartesian product of trees lead to fast algorithms. A new method for computing the hyperWiener index of partial cubes in general, and of benzenoid graphs and trees in particular, is also p...
متن کاملEmbedding Graphs with Bounded Treewidth into Optimal Hypercubes
In this paper, we present a one-to-one embedding of a graph with bounded treewidth into its optimal hypercube. This is the first time that embeddings of graphs with a very irregular structure into hypercubes are investigated. The dilation of the presented embedding is bounded by , where denotes the treewidth of the graph and denotes the maximal degree of a vertex in the graph. The given embeddi...
متن کاملMany to One Embeddings from Grids into Cylinders, Tori, and Hypercubes
We describe novel methods for embedding 2-dimensional grid graphs into cylinders (one way wrap-around grids), toruses and hypercubes where the guest grid G is larger than the host graph H, implying a many to one embedding. We call dj G j = j H je the optimal load, denoted l. We consider only optimal embeddings with respect to dilation and load, i.e., the dilation is one and the number of grid n...
متن کاملEmbeddings in Hypercubes
One important aspect of efficient use of a hypercube computer to solve a given problem is the assignment of subtasks to processors in such a way that the communication overhead is low. The subtasks and their inter-communication requirements can be modeled by a graph, and the assignment of subtasks to processors viewed as an embedding of the task graph into the graph of the hypercube network. We...
متن کامل